Search Results

Documents authored by Morik, Katharina

Document
DOI: 10.4230/LIPIcs.ECRTS.2018.6
Efficiently Approximating the Probability of Deadline Misses in Real-Time Systems

Authors: Georg von der Brüggen, Nico Piatkowski, Kuan-Hsun Chen, Jian-Jia Chen, and Katharina Morik

Published in: LIPIcs, Volume 106, 30th Euromicro Conference on Real-Time Systems (ECRTS 2018)

Abstract
This paper explores the probability of deadline misses for a set of constrained-deadline sporadic soft real-time tasks on uniprocessor platforms. We explore two directions to evaluate the probability whether a job of the task under analysis can finish its execution at (or before) a testing time point t. One approach is based on analytical upper bounds that can be efficiently computed in polynomial time at the price of precision loss for each testing point, derived from the well-known Hoeffding's inequality and the well-known Bernstein's inequality. Another approach convolutes the probability efficiently over multinomial distributions, exploiting a series of state space reduction techniques, i.e., pruning without any loss of precision, and approximations via unifying equivalent classes with a bounded loss of precision. We demonstrate the effectiveness of our approaches in a series of evaluations. Distinct from the convolution-based methods in the literature, which suffer from the high computation demand and are applicable only to task sets with a few tasks, our approaches can scale reasonably without losing much precision in terms of the derived probability of deadline misses.
Cite as

Georg von der Brüggen, Nico Piatkowski, Kuan-Hsun Chen, Jian-Jia Chen, and Katharina Morik. Efficiently Approximating the Probability of Deadline Misses in Real-Time Systems. In 30th Euromicro Conference on Real-Time Systems (ECRTS 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 106, pp. 6:1-6:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)

Copy BibTex To Clipboard

@InProceedings{vonderbruggen_et_al:LIPIcs.ECRTS.2018.6,
  author =	{von der Br\"{u}ggen, Georg and Piatkowski, Nico and Chen, Kuan-Hsun and Chen, Jian-Jia and Morik, Katharina},
  title =	{{Efficiently Approximating the Probability of Deadline Misses in Real-Time Systems}},
  booktitle =	{30th Euromicro Conference on Real-Time Systems (ECRTS 2018)},
  pages =	{6:1--6:22},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-075-0},
  ISSN =	{1868-8969},
  year =	{2018},
  volume =	{106},
  editor =	{Altmeyer, Sebastian},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.ECRTS.2018.6},
  URN =		{urn:nbn:de:0030-drops-89978},
  doi =		{10.4230/LIPIcs.ECRTS.2018.6},
  annote =	{Keywords: deadline miss probability, multinomial-based approach, analytical bound}
}
Document
DOI: 10.4230/DagRep.2.8.16
Mobility Data Mining and Privacy (Dagstuhl Seminar 12331)

Authors: Christopher W. Clifton, Bart Kuijpers, Katharina Morik, and Yucel Saygin

Published in: Dagstuhl Reports, Volume 2, Issue 8 (2013)

Abstract
This report documents the program and the outcomes of Dagstuhl Seminar 12331 "Mobility Data Mining and Privacy". Mobility data mining aims to extract knowledge from movement behaviour of people, but this data also poses novel privacy risks. This seminar gathered a multidisciplinary team for a conversation on how to balance the value in mining mobility data with privacy issues. The seminar focused on four key issues: Privacy in vehicular data, in cellular data, context-dependent privacy, and use of location uncertainty to provide privacy.
Cite as

Christopher W. Clifton, Bart Kuijpers, Katharina Morik, and Yucel Saygin. Mobility Data Mining and Privacy (Dagstuhl Seminar 12331). In Dagstuhl Reports, Volume 2, Issue 8, pp. 16-53, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2012)

Copy BibTex To Clipboard

@Article{clifton_et_al:DagRep.2.8.16,
  author =	{Clifton, Christopher W. and Kuijpers, Bart and Morik, Katharina and Saygin, Yucel},
  title =	{{Mobility Data Mining and Privacy (Dagstuhl Seminar 12331)}},
  pages =	{16--53},
  journal =	{Dagstuhl Reports},
  ISSN =	{2192-5283},
  year =	{2012},
  volume =	{2},
  number =	{8},
  editor =	{Clifton, Christopher W. and Kuijpers, Bart and Morik, Katharina and Saygin, Yucel},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagRep.2.8.16},
  URN =		{urn:nbn:de:0030-drops-37822},
  doi =		{10.4230/DagRep.2.8.16},
  annote =	{Keywords: Privacy, Mobility, Cellular, Vehicular Data}
}
Document
DOI: 10.4230/DagSemProc.07181.1
07181 Abstracts Collection – Parallel Universes and Local Patterns

Authors: Michael R. Berthold, Katharina Morik, and Arno Siebes

Published in: Dagstuhl Seminar Proceedings, Volume 7181, Parallel Universes and Local Patterns (2007)

Abstract
From 1 May 2007 to 4 May 2007 the Dagstuhl Seminar 07181 ``Parallel Universes and Local Patterns'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Michael R. Berthold, Katharina Morik, and Arno Siebes. 07181 Abstracts Collection – Parallel Universes and Local Patterns. In Parallel Universes and Local Patterns. Dagstuhl Seminar Proceedings, Volume 7181, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{berthold_et_al:DagSemProc.07181.1,
  author =	{Berthold, Michael R. and Morik, Katharina and Siebes, Arno},
  title =	{{07181 Abstracts Collection – Parallel Universes and Local Patterns }},
  booktitle =	{Parallel Universes and Local Patterns},
  pages =	{1--15},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7181},
  editor =	{Michael R. Berthold and Katharina Morik and Arno Siebes},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07181.1},
  URN =		{urn:nbn:de:0030-drops-12662},
  doi =		{10.4230/DagSemProc.07181.1},
  annote =	{Keywords: Local Patterns, Global Models, Parallel Universes, Descriptor Spaces}
}
Document
DOI: 10.4230/DagSemProc.07181.2
07181 Introduction – Parallel Universes and Local Patterns

Authors: Michael R. Berthold, Katharina Morik, and Arno Siebes

Published in: Dagstuhl Seminar Proceedings, Volume 7181, Parallel Universes and Local Patterns (2007)

Abstract
Learning in parallel universes and the mining for local patterns are both relatively new fields of research. Local pattern detection addresses the problem of identifying (small) deviations from an overall distribution of some underlying data in some feature space. Learning in parallel universes on the other hand, deals with the analysis of objects, which are given in different feature spaces, i.e.\ parallel universes; and the aim is on finding groups of objects, which show ``interesting'' behavior in some of these universes. So, while local patterns describe interesting properties of a subset of the overall space or set of objects, learning in parallel universes also aims at finding interesting patterns across different feature spaces or object descriptions. Dagstuhl Seminar~07181 on Parallel Universes and Local Patterns held in May 2007 brought together researchers with different backgrounds to discuss latest advances in both fields and to draw connections between the two.
Cite as

Michael R. Berthold, Katharina Morik, and Arno Siebes. 07181 Introduction – Parallel Universes and Local Patterns. In Parallel Universes and Local Patterns. Dagstuhl Seminar Proceedings, Volume 7181, pp. 1-4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{berthold_et_al:DagSemProc.07181.2,
  author =	{Berthold, Michael R. and Morik, Katharina and Siebes, Arno},
  title =	{{07181 Introduction – Parallel Universes and Local Patterns }},
  booktitle =	{Parallel Universes and Local Patterns},
  pages =	{1--4},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7181},
  editor =	{Michael R. Berthold and Katharina Morik and Arno Siebes},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07181.2},
  URN =		{urn:nbn:de:0030-drops-12655},
  doi =		{10.4230/DagSemProc.07181.2},
  annote =	{Keywords: Local Patterns, Global Models, Parallel Universes, Descriptor Spaces}
}
Document
DOI: 10.4230/DagSemProc.07181.5
Multi-Aspect Tagging for Collaborative Structuring

Authors: Katharina Morik and Michael Wurst

Published in: Dagstuhl Seminar Proceedings, Volume 7181, Parallel Universes and Local Patterns (2007)

Abstract
Local tag structures have become frequent though Web 2.0: Users "tag" their data without specifying the underlying semantics. A collection of media items is tagged multiply using different aspects, e.g., topic, genre, occasion, mood. Given the large number of local, individual structures, users could benefit from the tagging work of others ("folksonomies"). In contrast to distributed clustering, no global structure is wanted. Each user wants to keep the tags already annotated, wants to keep the diverse aspects under which the items were organized, and only wishes to enhance the own structure by those of others. A clustering algorithm which structures items has to take into account the local, multi-aspect nature of the task structures. The LACE algorithm (Wurst et al. 2006) is such a clustering algorithm.
Cite as

Katharina Morik and Michael Wurst. Multi-Aspect Tagging for Collaborative Structuring. In Parallel Universes and Local Patterns. Dagstuhl Seminar Proceedings, Volume 7181, pp. 1-5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007)

Copy BibTex To Clipboard

@InProceedings{morik_et_al:DagSemProc.07181.5,
  author =	{Morik, Katharina and Wurst, Michael},
  title =	{{Multi-Aspect Tagging for Collaborative Structuring}},
  booktitle =	{Parallel Universes and Local Patterns},
  pages =	{1--5},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2007},
  volume =	{7181},
  editor =	{Michael R. Berthold and Katharina Morik and Arno Siebes},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.07181.5},
  URN =		{urn:nbn:de:0030-drops-12635},
  doi =		{10.4230/DagSemProc.07181.5},
  annote =	{Keywords: Ensemble Clustering, automatic tagging, localized clustering}
}
Document
DOI: 10.4230/DagSemProc.04161.1
04161 Abstracts Collection – Detecting Local Patterns

Authors: Jean-François Boulicaut, Katharina Morik, and Arno Siebes

Published in: Dagstuhl Seminar Proceedings, Volume 4161, Detecting Local Patterns (2006)

Abstract
From 12.04.04 to 16.04.04, the Dagstuhl Seminar 04161 ``Detecting Local Patterns'' was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.
Cite as

Jean-François Boulicaut, Katharina Morik, and Arno Siebes. 04161 Abstracts Collection – Detecting Local Patterns. In Detecting Local Patterns. Dagstuhl Seminar Proceedings, Volume 4161, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2006)

Copy BibTex To Clipboard

@InProceedings{boulicaut_et_al:DagSemProc.04161.1,
  author =	{Boulicaut, Jean-Fran\c{c}ois and Morik, Katharina and Siebes, Arno},
  title =	{{04161 Abstracts Collection – Detecting Local Patterns}},
  booktitle =	{Detecting Local Patterns},
  pages =	{1--8},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2006},
  volume =	{4161},
  editor =	{Jean-Fran\{\backslashc\{c\}\}ois Boulicaut and Katharina Morik and Arno Siebes},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/DagSemProc.04161.1},
  URN =		{urn:nbn:de:0030-drops-4677},
  doi =		{10.4230/DagSemProc.04161.1},
  annote =	{Keywords: }
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact